package codeforces;

import java.util.Scanner;

public class DoubleCola {

	static String[] names = {
		"Sheldon", "Leonard", "Penny", "Rajesh", "Howard" 
	};
	
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int number = s.nextInt();
		int res = 0;
		
		int i = 0;
		int sum = 0;
		while(sum < number) {
			sum += 5 * Math.pow(2, i);
			i++;
		}
		int currIndex = i - 1;
		int numberDuplicate = number;
		int lastNumber = 0;
		for (int j = 0; j <= currIndex - 1; j++) {
			numberDuplicate -= 5 * (int) Math.pow(2, j);
		}
		
		lastNumber = numberDuplicate;
		int countOfEveryName = (int)Math.pow(2, currIndex);
		
		if(lastNumber % countOfEveryName == 0) {
			res = lastNumber / countOfEveryName;
 		} else {
 			res = lastNumber / countOfEveryName + 1;
 		}
		
		System.out.println(names[res - 1]);
		
	}

}
